Time complexity

Results: 894



#Item
761Optimal Random Sampling from Distributed Streams Revisited Srikanta Tirthapura1 and David P. Woodruff2 1  2

Optimal Random Sampling from Distributed Streams Revisited Srikanta Tirthapura1 and David P. Woodruff2 1 2

Add to Reading List

Source URL: home.engineering.iastate.edu

Language: English - Date: 2011-07-04 12:38:38
762A Perfect Storm, and Other Forecasts The Bible is full of images of God caring for his creation in all its complexity. Yet experts warn us that “a so-called perfect storm of factors” threatens the future of life on e

A Perfect Storm, and Other Forecasts The Bible is full of images of God caring for his creation in all its complexity. Yet experts warn us that “a so-called perfect storm of factors” threatens the future of life on e

Add to Reading List

Source URL: www.ivpress.com

Language: English - Date: 2014-05-07 11:48:08
763Introduction Ideas behind ETR and computing Euler-Poincaré Characteristic Algorithm for Computing the Euler-Poincaré characteristic

Introduction Ideas behind ETR and computing Euler-Poincaré Characteristic Algorithm for Computing the Euler-Poincaré characteristic

Add to Reading List

Source URL: www.math.purdue.edu

Language: English - Date: 2005-11-25 07:51:12
764A Model of Computation for MapReduce Howard Karloff∗ Siddharth Suri†  Abstract

A Model of Computation for MapReduce Howard Karloff∗ Siddharth Suri† Abstract

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2009-10-14 18:04:56
765Computing sparse multiples of polynomials∗  arXiv:1009.3214v2 [cs.SC] 1 Jan 2011 Mark Giesbrecht, Daniel S. Roche, and Hrushikesh Tilak Cheriton School of Computer Science, University of Waterloo

Computing sparse multiples of polynomials∗ arXiv:1009.3214v2 [cs.SC] 1 Jan 2011 Mark Giesbrecht, Daniel S. Roche, and Hrushikesh Tilak Cheriton School of Computer Science, University of Waterloo

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2011-01-03 22:38:51
766Tight Bounds for Distributed Selection Fabian Kuhn Institute of Theoretical Computer Science ETH Zurich, Switzerland

Tight Bounds for Distributed Selection Fabian Kuhn Institute of Theoretical Computer Science ETH Zurich, Switzerland

Add to Reading List

Source URL: distcomp.ethz.ch

Language: English - Date: 2007-04-02 04:50:42
767Microsoft PowerPoint - SPAA2007

Microsoft PowerPoint - SPAA2007

Add to Reading List

Source URL: distcomp.ethz.ch

Language: English - Date: 2007-07-02 03:57:47
768A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic Razvan Barbulescu1 , Pierrick Gaudry1 , Antoine Joux2,3 , and

A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic Razvan Barbulescu1 , Pierrick Gaudry1 , Antoine Joux2,3 , and

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2013-11-25 07:10:45
76915-854: Approximations Algorithms Topic: Dynamic Programming Scribe: Mihir Kedia

15-854: Approximations Algorithms Topic: Dynamic Programming Scribe: Mihir Kedia

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2005-10-28 08:20:42
770Article Submitted to Journal of Symbolic Computation  Subquadratic computation of vector

Article Submitted to Journal of Symbolic Computation Subquadratic computation of vector

Add to Reading List

Source URL: hal.archives-ouvertes.fr

Language: English - Date: 2006-10-04 06:47:04